Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms For Minimum-Cost Low-Degree Subgraphs
In this thesis we address problems in minimum-cost low-degree network design. In the design of communication networks we often face the problem of building a network connecting a large number of end-hosts. Available hardware or software often imposes additional restrictions on the topology of the network. One example for such a requirement arises in the area of computer networks: We are given a...
متن کاملLinear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems f...
متن کاملApproximation Algorithms for Budget Constrained Network Upgradeable Problems
We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph G = (V,E) where the weight an edge e ∈ E can be upgraded for a cost c(e). Given a budget B for improvement, the goal is to find a subset of edges to be upgraded so that the resulting network is optimum for B. The results obtained in this paper include the following. 1. Maximum Weight Constra...
متن کاملAn approximation algorithm for minimum-cost network design
This paper considers the problem of designing a minimum cost network meeting a given set of traac requirements between n sites, using one type of channels of a given capacity, with varying setup costs for diierent vertex pairs (comprised of a xed part plus a part dependent on the pair). An approximation algorithm is proposed for this problem, guaranteeing a solution whose cost is greater than t...
متن کاملApproximation Algorithms to the Network Design Problems
Preface In spite of the outstanding progress in combinatorial optimization, most problems classified as NP-hard were left untouched for a long time. However, some challenges have appeared for dealing with such problems recently. One of them is the framework of approximation algorithms. An approximation algorithm usually guarantees that the cost of the computed solution is bounded by some factor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2001
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-001-0038-2